On the Power of Real { Time Turing Machines : k
نویسندگان
چکیده
We show that, for any integer k, there is at least one language which is accepted by a k-tape real{time Turing machine, but cannot be accepted by a (k 1)-tape real{time Turing machine. We show therefore that the languages accepted by real{time Turing machines form an in nite hierarchy with respect to the number of tapes used.
منابع مشابه
Some improvements in fuzzy turing machines
In this paper, we improve some previous definitions of fuzzy-type Turing machines to obtain degrees of accepting and rejecting in a computational manner. We apply a BFS-based search method and some level’s upper bounds to propose a computational process in calculating degrees of accepting and rejecting. Next, we introduce the class of Extended Fuzzy Turing Machines equipped with indeterminacy s...
متن کاملNo . 99 - 429 On the Power of Real { Time Turing Machines : kTapes Are More Powerful than
We show that, for any integer k, there is at least one language which is accepted by a k-tape real{time Turing machine, but cannot be accepted by a (k ? 1)-tape real{time Turing machine. We show therefore that the languages accepted by real{time Turing machines form an innnite hierarchy with respect to the number of tapes used.
متن کاملTime-Restricted Sequence Generation
The classes of sequences generated by timeand spacerestricted multiple counter machines are compared to the corresponding classes generated by similarly restricted multiple tape Turing machines. Special emphasis is placed on the class of sequences generable by machines which operate in real time. Real-time Turing machines are shown to be strictly more powerful than real-time counter machines. A...
متن کاملOn the Power of Real Turing Machines Over Binary Inputs
In recent years the study of the complexity of computational problems involving real numbers has been an increasing research area. A founda-tional paper has been 4] where a computational model |the real Turing machine| for dealing with the above problems was developed. One research direction that has been studied intensively during the last two years is the computational power of real Turing ma...
متن کاملDynamic Turing Machine: model and properties for runtime code changes
In this paper, a dynamic model of computation based on the Universal Turing Machine is proposed. This model is capable of applying runtime code modifications for 3-symbol deterministic Turing Machines at runtime and requires a decomposition of the simulated machine into parts called subtasks. The algorithm for performing runtime changes is considered, and the ability to apply runtime changes is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999